A new upper bound for the total vertex irregularity strength of graphs
نویسندگان
چکیده
منابع مشابه
A new upper bound for the total vertex irregularity strength of graphs
We investigate the following modification of the well known irregularity strength of graphs. Given a total weighting w of a graph G = (V,E) with elements of a set {1, 2, . . . , s}, denote wtG(v) = ∑ e3v w(e)+w(v) for each v ∈ V . The smallest s for which exists such a weighting with wtG(u) 6= wtG(v) whenever u and v are distinct vertices of G is called the total vertex irregularity strength of...
متن کاملTotal vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملA New Upper Bound for the Irregularity Strength of Graphs
A weighting of the edges of a graph is called irregular if the weighted degrees of the vertices are all different. In this note we show that such a weighting is possible from the weight set {1, 2, . . . , 6dnδ e} for all graphs not containing a component with exactly 2 vertices or two isolated vertices.
متن کاملOn total vertex irregularity strength of graphs
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths of graphs. In this paper we discuss how the addition of new edge affect the total vertex irregularity strength.
متن کاملtotal vertex irregularity strength of corona product of some graphs
a vertex irregular total k-labeling of a graph g with vertex set v and edge set e is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. the total vertex irregularity strength of g, denoted by tvs(g)is the minimum value of the largest label k over all such irregular assignment. in this paper, we study the to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.05.023